Approximate Solutions of Continuous-Time Stochastic Games
نویسندگان
چکیده
منابع مشابه
Continuous-time stochastic games
We study continuous-time stochastic games (with finitely many states and actions), with a focus on the existence of their equilibria that are insensitive to a small imprecision in the specification of players’ evaluations of streams of payoffs. We show that the stationary, namely, time-independent, discounting game has a stationary equilibrium, that the (not necessarily stationary) discounting ...
متن کاملDiscrete and Continuous ambush games: optimal policies and approximate solutions
We consider an autonomous navigation problem, whereby a traveler aims at traversing an environment in which an adversary tries to set an ambush. A two players zero sum game is introduced. Players’ strategies are computed as random path distributions, a realization of which is the path chosen by the traveler. A parallel is drawn between the discrete problem, where the traveler moves on a network...
متن کاملContinuous-Time Stochastic Games with Time-Bounded Reachability
We study continuous-time stochastic games with time-bounded reachability objectives and time-abstract strategies. We show that each vertex in such a game has a value (i.e., an equilibrium probability), and we classify the conditions under which optimal strategies exist. Further, we show how to compute εoptimal strategies in finite games and provide detailed complexity estimations. Moreover, we ...
متن کاملBlackwell-Nash Equilibrium for Discrete and Continuous Time Stochastic Games
We consider both discrete and continuous time finite state-action stochastic games. In discrete time stochastic games, it is known that a stationary BlackwellNash equilibrium (BNE) exists for a single controller additive reward (SC-AR) stochastic game which is a special case of a general stochastic game. We show that, in general, the additive reward condition is needed for the existence of a BN...
متن کاملApproximate Solutions of Continuous Dispersion Problems
The problem of positioning p points so as to maximize the minimum distance between them has been studied in both location theory (as the continuous p-dispersion problem) and the design of computer experiments (as the maximin distance design problem). This problem can be formulated as a nonlinear program, either exactly or approximately. We consider formulations of both types and demonstrate tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 2016
ISSN: 0363-0129,1095-7138
DOI: 10.1137/16m1062247